The LFOPC leap-frog algorithm for constrained optimization

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outlier Removal in 2D Leap Frog Algorithm

In this paper a 2D Leap Frog Algorithm is applied to solve the so-called noisy Photometric Stereo problem. In 3-source Photometric Stereo (noiseless or noisy) an ideal unknown Lambertian surface is illuminated from distant light-source directions (their directions are assumed to be linearly independent). The subsequent goal, given three images is to reconstruct the illuminated object’s shape. U...

متن کامل

A Second-order Stochastic Leap-frog Algorithm for Langevin Simulation

Langevin simulation provides an effective way to study collisional effects in beams by reducing the six-dimensional Fokker-Planck equation to a group of stochastic ordinary differential equations. These resulting equations usually have multiplicative noise since the diffusion coefficients in these equations are functions of position and time. Conventional algorithms, e.g. Euler and Heun, give o...

متن کامل

A Parallel Leap-frog Algorithm for 3-Source Photometric Stereo

Existing Photometric Stereo methods provide reasonable surface reconstructions unless the irradiance image is corrupted with noise and effects of digitisation. However, in real world situations the measured image is almost always corrupted, so an efficient method must be formulated to denoise the data. Once noise is added at the level of the images the noisy Photometric Stereo problem with a le...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Constrained Optimization Evolutionary Algorithm

Constrained optimization evolutionary algorithm (COEA) is a mathematical programming problem frequently encountered in the field of engineering application. Solving constrained optimization problems by COEA has become an important research area of evolutionary computation in recent years. In this paper, the constrained optimization evolutionary algorithm is based on the quantum evolutionary alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2000

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(00)85018-x